Customizing methods for global optimization-a geometric viewpoint
نویسندگان
چکیده
منابع مشابه
Geometric branch-and-bound methods for constrained global optimization problems
Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary bounding operations. In particular, our main goal is to prove the convergence of the suggested method...
متن کاملA Geometric Terrain Methodology for Global Optimization
Global optimization remains an important area of active research. Many macroscopic and microscopic applications in science and engineering still present formidable challenges to current global optimization techniques. In this work, a completely different, novel and general geometric framework for continuous global optimization is described. The proposed methodology is based on intelligent movem...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملA Geometric Approach to Global Optimization
In this paper we consider the problem of optimizing a piecewise-linear objective function over a non-convex domain. In particular we do not allow the solution to lie in the interior of a prespeciied region R. We discuss the geometrical properties of this problems and present algorithms based on combinatorial arguments. In addition we show how we can construct quite complicated shaped sets R whi...
متن کاملHomotopy Optimization Methods for Global Optimization
We define a new method for global optimization, the Homotopy Optimization Method (HOM). This method differs from previous homotopy and continuation methods in that its aim is to find a minimizer for each of a set of values of the homotopy parameter, rather than to follow a path of minimizers. We define a second method, called HOPE, by allowing HOM to follow an ensemble of points obtained by per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 1993
ISSN: 0925-5001,1573-2916
DOI: 10.1007/bf01096738